Package edu.claflin.finder.algo

Contains the Algorithm code for finding bipartite subgraphs.

Class Summary

Class	Description
Algorithm	Abstraction of the algorithm classes used for finding subgraphs.
ArgumentsBundle	Used to supply arguments to Algorithms in a generalized manner.
BreadthFirstTraversalSearch	Processes a Graph searching for subgraphs by performing a breadth first search on each node of the graph.
BronKerbosch	Finds Maximum Cliques and Bicliques with Bron Kersboch Algorithm.
Bundle	Processes a Graph searching for subgraphs.
ConnectedComponentsDFS	Processes a Graph searching for connected components by performing a depth first search on each node.
DepthFirstTraversalSearch	Processes a Graph searching for bipartite subgraphs by performing a depth first search on each node.
DijkstraShortestPath
Kruskal
MatrixPatternAnalyzer	Deprecated. No replacement yet.
Prim
ShortestPath

Enum Summary

Enum	Description
Algorithm.GraphSortOrder
ArgumentsBundle.COMMON_ARGS	An enumeration containing common arguments used by the program.